A Basis for a Multi-Level Meta-Logic Programming Language
نویسندگان
چکیده
We are developing a multilevel metalogic programming language that we call Alloy. It is based on rst-order predicate calculus extended with metalogical constructs. An Alloy program consists of a collection of theories, all in the same language, and a representation relation over these theories. The whole language is self-representable, including names for expressions with variables. A signiicant diierence, as compared with many previous approaches, is that an arbitrary number of metalevels can be employed and that the object-meta relationship between theories need not be circular. The language is primarily intended for representation of knowledge and metaknowledge and is currently being used in research on hierarchical representation of legal knowledge. We believe that the language allows sophisticated expression and eecient automatic deduction of interesting sets of beliefs of agents. This paper aims to give a preliminary and largely informal deeni-tion of the core of the language, a simple but incomplete and ineecient proof system for the language and a sketch of an alternative, more ef-cient, proof system. The latter is intended to be used as a procedural semantics for the language. It is being implemented by an extension of an abstract machine for Prolog. 1 Introduction We are interested in the representation of complex formalized knowledge,
منابع مشابه
Solution Strategies for Multi-domain Constraint Logic Programs
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation. Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones, that allow an efficient evalu...
متن کاملDesigning a Meta-Heuristic Algorithm Based on a Simple Seeking Logic
Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...
متن کاملReasoning about Fluents in Logic Programming
Fluent Logic Programming (FLP) is an attempt to suitably combine into a simple language ideas coming from well known temporal reasoning frameworks like Kowalski's Event Calculus and Sandewall's Features and Fluents. In this paper we propose the core syntax of FLP together with two complementary semantics. The rst one is a x-point semantics which declaratively captures the operational notion of ...
متن کاملExtending a UML and OCL Tool for Meta-Modeling: Applications towards Model Quality Assessment
For developing software in a model-driven style, metaand multi-level modeling is currently gaining more and more attention. In this contribution, we propose an approach to extend a two-level modeling tool to three-level modeling by adding a meta-model at the topmost level. Standard OCL does not support reflective constraints, i.e., constraints concerning properties of the model like the depth o...
متن کاملA Meta Constraint Logic Programming Scheme
We present a Meta Constraint Logic Programming (MCLP) general scheme. The idea behind the work concerns the possibility of building meta CLP architectures by adding CLP solvers as meta level reasoners on the constraints of the underlying object systems. In this way, we are able not only to increase the expressive power of CLP, but also to implement several constraint satisfaction techniques lik...
متن کامل